home *** CD-ROM | disk | FTP | other *** search
/ Power Programmierung 2 / Power-Programmierung CD 2 (Tewi)(1994).iso / c / library / dos / diverses / leda / incl / dictiona.h < prev    next >
Encoding:
C/C++ Source or Header  |  1991-11-15  |  2.5 KB  |  80 lines
  1. /*******************************************************************************
  2. +
  3. +  LEDA  2.1.1                                                 11-15-1991
  4. +
  5. +
  6. +  dictionary.h
  7. +
  8. +
  9. +  Copyright (c) 1991  by  Max-Planck-Institut fuer Informatik
  10. +  Im Stadtwald, 6600 Saarbruecken, FRG     
  11. +  All rights reserved.
  12. + 
  13. *******************************************************************************/
  14.  
  15.  
  16.  
  17.  
  18.  
  19. //------------------------------------------------------------------------------
  20. //
  21. // dictionary  (data structure: red black trees)
  22. //
  23. // Stefan Naeher (1989)
  24. //
  25. //------------------------------------------------------------------------------
  26.  
  27. #ifndef DICTIONARYH
  28. #define DICTIONARYH
  29.  
  30. #ifndef RBTREEH
  31. #include <LEDA/rb_tree.h>
  32. #endif
  33.  
  34. typedef rb_tree_node* dic_item;
  35.  
  36. #define dictionary(keytype,infotype) name3(keytype,infotype,dictionary)
  37.  
  38.  
  39. #define dictionarydeclare2(keytype,infotype)\
  40. \
  41. struct dictionary(keytype,infotype) : public rb_tree {\
  42. \
  43. int  cmp(ent& x, ent& y) const { return compare(*(keytype*)&x,*(keytype*)&y); }\
  44. void clear_key(ent& x)   const { Clear(*(keytype*)&x); }\
  45. void clear_inf(ent& x)   const { Clear(*(infotype*)&x); }\
  46. void copy_key(ent& x)    const { Copy(*(keytype*)&x); }\
  47. void copy_inf(ent& x)    const { Copy(*(infotype*)&x); }\
  48. \
  49. int       defined(keytype y) const { return rb_tree::member(Ent(y)); }\
  50. dic_item  lookup(keytype y)  const { return rb_tree::lookup(Ent(y)); }\
  51. infotype& info(dic_item it)     { return *(infotype*)&(rb_tree::info(it)); } \
  52. void      change_inf(dic_item it, infotype i) { info(it) = i; }\
  53. \
  54. dic_item  insert(keytype y,infotype x)\
  55.                                 { return rb_tree::insert(Ent(y),Ent(x)); } \
  56. \
  57. void      del(keytype y)         { rb_tree::del(Ent(y)); } \
  58. void      del_item(dic_item it)  { del(key(it)); } \
  59. keytype   key(dic_item it)  const { return keytype(rb_tree::key(it)); }\
  60. infotype  inf(dic_item it)  const { return infotype(rb_tree::info(it)); } \
  61. infotype  access(keytype k) const { return inf(lookup(k));}\
  62. \
  63. dictionary(keytype,infotype)& operator =(const dictionary(keytype,infotype)& D)\
  64. { return (dictionary(keytype,infotype)&)rb_tree::operator=(rb_tree((rb_tree&) D)); }\
  65. \
  66.  dictionary(keytype,infotype)()   {}\
  67.  dictionary(keytype,infotype)(const dictionary(keytype,infotype)& D) :\
  68.   rb_tree((rb_tree&) D)   {}\
  69. ~dictionary(keytype,infotype)()   { clear(); }\
  70. } ;
  71.  
  72.  
  73. // ----------------------------------------------------------------
  74. // iteration
  75. // ----------------------------------------------------------------
  76.  
  77. #define forall_dic_items(i,D) for(i = (D).first_item(); i; i=(D).next_item(i))
  78.  
  79. #endif
  80.